Grammars with Regulated Rewriting
نویسنده
چکیده
Context-free grammars are not able to cover all linguistic phenomena. Thus we define some types of grammars where context-free rules are used and restriction imposed on the derivations. We illustrate the concepts by example, compare the generative power, give some closure and decidability properties and basic facts on syntactic complexity.
منابع مشابه
Unconditional Transfer in Regulated Rewriting Unconditional Transfer in Regulated Rewriting
In this paper, we investigate the concept of unconditional transfer within various forms of regulated grammars like programmed grammars, matrix grammars, grammars with regular control, grammars controlled by bicoloured digraphs, periodically time-variant grammars and variants thereof, especially regarding their descriptive capacity both as language generating and as language accepting devices. ...
متن کاملParsing Algorithms for Grammars with Regulated Rewriting
In recent papers [4, 5, 8, 11] Petri net controlled grammars have been introduced and investigated. It was shown that various regulated grammars such as random context, matrix, vector, valence grammars, etc., resulted from enriching context-free grammars with additional mechanisms can be unified into the Petri net formalism, i.e., a grammar and its control can be represented by a Petri net. Thi...
متن کاملRegulated Array Grammars of Finite Index. Part I: Theoretical Investigations
We consider regulated (n-dimensional) context-free array grammars of nite index, i.e., with a limited number of active areas. This research is motivated by the observation that in several practical applications of array grammars only such a bounded number of active areas is observed. Combined with diierent methods known from regulated rewriting (e.g., matrix grammars, programmed grammars, gramm...
متن کاملGraph grammars with string-regulated rewriting
Multicellular organisms undergo a complex developmental process, orchestrated by the genetic information in their cells, in order to form a newborn individual from a fertilized egg. This complex process, not completely understood yet, is believed to have a key role in generating the impressive biotic diversity of organisms found on earth. Inspired by mechanisms of Eukaryotic genetic expression,...
متن کاملOn the Complexity of Szilard Languages of Regulated Grammars
We investigate computational resources used by alternating Turing machines (ATMs) to accept Szilard languages (SZLs) of regulated rewriting grammars. The main goal is to relate these languages to lowlevel complexity classes such asNC1 andNC2. We focus on the derivation process in random context grammars (RCGs) with context-free rules. We prove that unrestricted SZLs and leftmost-1 SZLs of RCGs ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1986